0.08/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/0.13 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.13/0.34 % Computer : n021.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1200 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Jul 13 11:49:40 EDT 2021 0.13/0.35 % CPUTime : 0.13/0.35 % Number of cores: 8 0.13/0.35 % Python version: Python 3.6.8 0.13/0.35 # Version: 2.6rc1-ho 0.13/0.35 # No SInE strategy applied 0.13/0.35 # Trying AutoSched0 for 59 seconds 0.13/0.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N 0.13/0.38 # and selection function SelectUnlessUniqMax. 0.13/0.38 # 0.13/0.38 # Preprocessing time : 0.028 s 0.13/0.38 # Presaturation interreduction done 0.13/0.38 0.13/0.38 # Proof found! 0.13/0.38 # SZS status Theorem 0.13/0.38 # SZS output start CNFRefutation 0.13/0.38 thf(cX2115, conjecture, (((![X1:$i]:(![X2:$i]:cP @ X2 @ X2<=?[X3:$i]:cP @ X1 @ X3)&![X4:$i]:(cQ @ X4=>~(cM @ (g @ X4))))&![X5:$i]:?[X6:$i]:(cP @ X5 @ X6|(cM @ X5&cQ @ (f @ X5 @ X6))))=>![X5:$i]:?[X6:$i]:(cP @ X5 @ X5&cP @ (g @ X5) @ X6)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cX2115)). 0.13/0.38 thf(c_0_1, negated_conjecture, ~((((![X1:$i]:(?[X3:$i]:cP @ X1 @ X3=>![X2:$i]:cP @ X2 @ X2)&![X4:$i]:(cQ @ X4=>~cM @ (g @ X4)))&![X5:$i]:?[X6:$i]:(cP @ X5 @ X6|(cM @ X5&cQ @ (f @ X5 @ X6))))=>![X5:$i]:?[X6:$i]:(cP @ X5 @ X5&cP @ (g @ X5) @ X6))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cX2115])])). 0.13/0.38 thf(c_0_2, negated_conjecture, ![X15:$i, X16:$i, X17:$i, X18:$i, X19:$i, X23:$i]:((((~cP @ X15 @ X16|cP @ X17 @ X17)&(~cQ @ X18|~cM @ (g @ X18)))&((cM @ X19|cP @ X19 @ (esk1_1 @ X19))&(cQ @ (f @ X19 @ (esk2_1 @ X19))|cP @ X19 @ (esk1_1 @ X19))))&(~cP @ esk3_0 @ esk3_0|~cP @ (g @ esk3_0) @ X23)), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])). 0.13/0.38 thf(c_0_3, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:(cP @ X3 @ X3|~cP @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_2])). 0.13/0.38 thf(c_0_4, negated_conjecture, ![X1:$i]:(cM @ X1|cP @ X1 @ (esk1_1 @ X1)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.13/0.38 thf(c_0_5, negated_conjecture, ![X1:$i]:(~cP @ esk3_0 @ esk3_0|~cP @ (g @ esk3_0) @ X1), inference(split_conjunct,[status(thm)],[c_0_2])). 0.13/0.38 thf(c_0_6, negated_conjecture, ![X1:$i, X2:$i]:(cP @ X1 @ X1|cM @ X2), inference(spm,[status(thm)],[c_0_3, c_0_4])). 0.13/0.38 thf(c_0_7, negated_conjecture, ![X1:$i]:(~cQ @ X1|~cM @ (g @ X1)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.13/0.38 thf(c_0_8, negated_conjecture, ![X1:$i]:cM @ X1, inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_6])). 0.13/0.38 thf(c_0_9, negated_conjecture, ![X1:$i]:(cQ @ (f @ X1 @ (esk2_1 @ X1))|cP @ X1 @ (esk1_1 @ X1)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.13/0.38 thf(c_0_10, negated_conjecture, ![X1:$i]:~cQ @ X1, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8])])). 0.13/0.38 thf(c_0_11, negated_conjecture, ![X1:$i]:cP @ X1 @ (esk1_1 @ X1), inference(sr,[status(thm)],[c_0_9, c_0_10])). 0.13/0.38 thf(c_0_12, negated_conjecture, ~cP @ esk3_0 @ esk3_0, inference(spm,[status(thm)],[c_0_5, c_0_11])). 0.13/0.38 thf(c_0_13, negated_conjecture, ![X1:$i]:cP @ X1 @ X1, inference(spm,[status(thm)],[c_0_3, c_0_11])). 0.13/0.38 thf(c_0_14, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_13])]), ['proof']). 0.13/0.38 # SZS output end CNFRefutation 0.13/0.38 # Proof object total steps : 15 0.13/0.38 # Proof object clause steps : 12 0.13/0.38 # Proof object formula steps : 3 0.13/0.38 # Proof object conjectures : 15 0.13/0.38 # Proof object clause conjectures : 12 0.13/0.38 # Proof object formula conjectures : 3 0.13/0.38 # Proof object initial clauses used : 5 0.13/0.38 # Proof object initial formulas used : 1 0.13/0.38 # Proof object generating inferences : 4 0.13/0.38 # Proof object simplifying inferences : 6 0.13/0.38 # Training examples: 0 positive, 0 negative 0.13/0.38 # Parsed axioms : 6 0.13/0.38 # Removed by relevancy pruning/SinE : 0 0.13/0.38 # Initial clauses : 10 0.13/0.38 # Removed in clause preprocessing : 5 0.13/0.38 # Initial clauses in saturation : 5 0.13/0.38 # Processed clauses : 18 0.13/0.38 # ...of these trivial : 0 0.13/0.38 # ...subsumed : 0 0.13/0.38 # ...remaining for further processing : 18 0.13/0.38 # Other redundant clauses eliminated : 0 0.13/0.38 # Clauses deleted for lack of memory : 0 0.13/0.38 # Backward-subsumed : 1 0.13/0.38 # Backward-rewritten : 7 0.13/0.38 # Generated clauses : 9 0.13/0.38 # ...of the previous two non-trivial : 10 0.13/0.38 # Contextual simplify-reflections : 1 0.13/0.38 # Paramodulations : 8 0.13/0.38 # Factorizations : 0 0.13/0.38 # NegExts : 0 0.13/0.38 # Equation resolutions : 0 0.13/0.38 # Propositional unsat checks : 0 0.13/0.38 # Propositional check models : 0 0.13/0.38 # Propositional check unsatisfiable : 0 0.13/0.38 # Propositional clauses : 0 0.13/0.38 # Propositional clauses after purity: 0 0.13/0.38 # Propositional unsat core size : 0 0.13/0.38 # Propositional preprocessing time : 0.000 0.13/0.38 # Propositional encoding time : 0.000 0.13/0.38 # Propositional solver time : 0.000 0.13/0.38 # Success case prop preproc time : 0.000 0.13/0.38 # Success case prop encoding time : 0.000 0.13/0.38 # Success case prop solver time : 0.000 0.13/0.38 # Current number of processed clauses : 4 0.13/0.38 # Positive orientable unit clauses : 3 0.13/0.38 # Positive unorientable unit clauses: 0 0.13/0.38 # Negative unit clauses : 1 0.13/0.38 # Non-unit-clauses : 0 0.13/0.38 # Current number of unprocessed clauses: 0 0.13/0.38 # ...number of literals in the above : 0 0.13/0.38 # Current number of archived formulas : 0 0.13/0.38 # Current number of archived clauses : 14 0.13/0.38 # Clause-clause subsumption calls (NU) : 3 0.13/0.38 # Rec. Clause-clause subsumption calls : 2 0.13/0.38 # Non-unit clause-clause subsumptions : 1 0.13/0.38 # Unit Clause-clause subsumption calls : 4 0.13/0.38 # Rewrite failures with RHS unbound : 0 0.13/0.38 # BW rewrite match attempts : 9 0.13/0.38 # BW rewrite match successes : 6 0.13/0.38 # Condensation attempts : 0 0.13/0.38 # Condensation successes : 0 0.13/0.38 # Termbank termtop insertions : 736 0.13/0.38 0.13/0.38 # ------------------------------------------------- 0.13/0.38 # User time : 0.026 s 0.13/0.38 # System time : 0.006 s 0.13/0.38 # Total time : 0.032 s 0.13/0.38 # Maximum resident set size: 1636 pages 0.13/0.38 EOF